منابع مشابه
Commutative Queries
7 We consider polynomial-time Turing machines that have access to two oracles and investigate when the order of oracle queries is significant. The oracles used here are complete languages for the Polynomial Hierarchy (PH). We prove that, for solving decision problems, the order of oracle queries does not matter. This improves upon the previous result of Hemaspaandra, Hemaspaandra and Hempel, wh...
متن کامل1 Commutative Queries
7 We consider polynomial-time Turing machines that have access to two oracles and investigate when the order of oracle queries is significant. The oracles used here are complete languages for the Polynomial Hierarchy (PH). We prove that, for solving decision problems, the order of oracle queries does not matter. This improves upon the previous result of Hemaspaandra, Hemaspaandra and Hempel, wh...
متن کاملNon-commutative Gröbner Bases for Commutative Algebras
An ideal I in the free associative algebra k〈X1, . . . ,Xn〉 over a field k is shown to have a finite Gröbner basis if the algebra defined by I is commutative; in characteristic 0 and generic coordinates the Gröbner basis may even be constructed by lifting a commutative Gröbner basis and adding commutators.
متن کاملNon-commutative oscillators and the commutative limit
It is shown in first order perturbation theory that anharmonic oscillators in non-commutative space behave smoothly in the commutative limit just as harmonic oscillators do. The non-commutativity provides a method for converting a problem in degenerate perturbation theory to a non-degenerate problem. In the last few years theories in non-commutative space [1]-[5] have been studied extensively. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2001
ISSN: 0890-5401
DOI: 10.1006/inco.2000.2918